On generalized symbols, orders and quasi-orders

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Priestley Quasi-Orders

We introduce generalized Priestley quasi-orders and show that subalgebras of bounded distributive meet-semilattices are dually characterized by means of generalized Priestley quasi-orders. This generalizes the well-known characterization of subalgebras of bounded distributive lattices by means of Priestley quasiorders (Adams, Algebra Univers 3:216–228, 1973; Cignoli et al., Order 8(3):299– 315,...

متن کامل

On Generalized Interval Orders

In this paper, we introduce the notion of generalized interval order (GIO) which extends the notion of interval order in non-transitive binary relations. This allow us to extend the classical representation theorem of Fishburn in [5]. We also provide sufficient conditions which ensure the existence of the Generalized Optimal Choice Set (GOCS) of GIOs. Finally, we characterize the existence of t...

متن کامل

Well - Quasi - Orders Christian

Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (wqo) which is characterized by the absence of “bad” sequences (our proofs are along the lines of the proof of Nash-Williams [1], from which we also borrow terminology). Our main results are instantiations for the product type, the list type, and a type of finite trees, which (almost) directly foll...

متن کامل

Well-Quasi-Orders

Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (wqo) which is characterized by the absence of “bad” sequences (our proofs are along the lines of the proof of Nash-Williams [1], from which we also borrow terminology). Our main results are instantiations for the product type, the list type, and a type of finite trees, which (almost) directly foll...

متن کامل

Recursively Deened Quasi Orders on Terms

We study the problems involved in the recursive de nition of (quasi) orders on terms, focussing on the question of establishing well-de nedness, and the properties required for partial and quasi-orders: irre exivity and transitivity, and re exivity and transitivity, respectively. These properties are in general di cult to establish and this has in many cases come down in the literature as folkl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publicacions Matemàtiques

سال: 1985

ISSN: 0214-1493

DOI: 10.5565/publmat_292385_08